Analyzing Directed Acyclic Graph Recombination
نویسندگان
چکیده
This work studies the edge-based representation of directed acyclic graphs, as well as the properties of recombination operators working on it. It is shown that this representation is not separable, and the structure of the basic information units that must be processed in order to maintain feasibility of the solutions is described. As an experimental analysis indicates, a recombination operator using these units has subquadratic complexity in the graph size. It is also shown that a standard gene-transmission recombination operator is biased to produce solutions of lower edge-density than the parents’ average. An unbiased allelic recombination operator provides better results on an ad-hoc test problem.
منابع مشابه
Random acyclic orientations of graphs
II Preface This is a Master's thesis written at the department of Mathematics at the Royal Institute of Technology (KTH) in Stockholm, supervised by Svante Linusson. It is assumed that the reader has studied mathematics at an undergraduate level, and that he is well acquainted with some basic graph theory concepts such as paths and cycles. III Summary This paper is about acyclic orientations of...
متن کاملDAGViz: a directed acyclic graph browser that supports analysis of Gene Ontology annotation
The number of nucleotide and protein sequences deposited in public databases has rapidly increased in recent times. To provide consistent annotation of orthologous genes across organisms, annotation using Gene Ontology (GO) terms is shared among most of these databases. GO outlines a structured vocabulary used for describing biological properties of gene products. The illustration of GO terms u...
متن کاملTraac Equilibrium: Link Flows, Path Flows and Weakly/strongly Acyclic Solutions
We consider two variational inequality formulations of the static traac equilibrium problem with xed demand. We determine when an arc-ow formulation can be considered to be equivalent to a path-ow formulation by analyzing the eeect of the form of the travel-time cost function on whether a ow between an origin-destination pair can use all arcs of a directed cycle. An important tool in the analys...
متن کاملSeeing the trees and their branches in the network is hard
Phylogenetic networks are a restricted class of directed acyclic graphs that model evolutionary histories in the presence of reticulate evolutionary events, such as horizontal gene transfer, hybrid speciation, and recombination. Characterizing a phylogenetic network as a collection of trees and their branches has long been the basis for several methods of reconstructing and evaluating phylogene...
متن کاملEstimating the Ancestral Recombinations Graph (ARG) as Compatible Networks of SNP Patterns
Traditionally nonrecombinant genome, i.e., mtDNA or Y chromosome, has been used for phylogeography, notably for ease of analysis. The topology of the phylogeny structure in this case is an acyclic graph, which is often a tree, is easy to comprehend and is somewhat easy to infer. However, recombination is an undeniable genetic fact for most part of the genome. Driven by the need for a more compl...
متن کامل